Commutation of Cellular Automata Rules
نویسنده
چکیده
This paper addresses the following problem: Given a onedimensional cellular automata (CAl defined over Z2 with a rule represented by an operat or X , determine all one-dimensional rules over Z2 which commute with X . It is shown th at the set of all such rules is given by th e solut ion set of a system of nonlinear Diophantine equations. This result is generalized to cover cellular automata whose rules obey a relat ion first studied by Ito , and to the case of idempotent rules. Connect ions are shown between the results presented in this paper and work on the commuting block map problem [24] , which is known to have significance for the study of Bernoulli shift systems. 1. Int roduction In severa l previous pap ers [5, 6] an operator form alism was int roduced to st udy cellular automata (CA) ru les defined over Zp where p is pr ime. Using thi s formalism , resul ts have been obtain ed on inversion of certain auto mata ru les [7], on ent ropic properti es of automata rules [8], and on the question of determining fixed points and shift cycles [9]. Recent ly a division algorit hm was discovered and the arit hmet ic of residues for one-d imension al auto mata rules st udied [1 0]. In this paper attent ion is restricted to one-dimensional automata defined over Z2. For this subset of cellular automata we consider t he following problem: Let X be t he operator represent ation of a given CA rule. Find the set { A I AX = X A }. Our goal is to prov ide a means of computi ng all ru les A that comm ut e with t he given rul e X . It is shown that t he set of all such A is determ ined by the solut ion set of a system of non linear Dioph antine equat ions, which exhibits an elegant st ructure. This result is significant for severa l reasons. It is of int rinsic interest for the insight it provides in the struc ture of CA rul e space [11], allowing us to study properti es of maximal commut ing subsets of t his space; it generalizes to rules sharing a relat ion of the form first st udied by Ito [1]; and , as will be discussed in section 6, it bears a direct relation to the "commuting block map" problem, and hence to commutat ion propert ies of endomorphisms of Bernoulli shift systems [24].
منابع مشابه
Edge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملارائه روشی برای رمزنگاری تصاویر با استفاده از اتوماتای سلولی ترکیبی
In this paper, a new structure for image encryption using hybrid cellular automata is presented. The image encryption is done in two steps. At the first step, each pixel is encrypted by rules of hybrid cellular automata. In the next step, each pixel converted to a binary number and each bit is encrypted by rules of cellular automata. The rules are made by a function. Due to reversibility of cel...
متن کاملModeling Urban Sprawling of Tehran Metropolitan Area Based on PSO
The main goal of the present study was to implement a hybrid pattern of cellular automata model and particle swarm optimization algorithm based on TM and ETM+ imagery of landsat satellite from 1988 to 2010 for simulating the urban sprawling. In this study, an alternative model was implemented in two ways: the first method was based on two images (1988 and 2010) and the second one was based on t...
متن کاملUrban Growth Modeling using Integrated Cellular Automata and Gravitational Search Algorithm (Case Study: Shiraz City, Iran)
Cities are growing and encountering many changes over time due to population growth and migration. Identification and detection of these changes play important roles in urban management and sustainable development. Urban growth models are divided into two main categories: first cellular models which are further divided into experimental, dynamic, and integrated models and second vector models. ...
متن کاملImproved Frog Leaping Algorithm Using Cellular Learning Automata
In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Complex Systems
دوره 7 شماره
صفحات -
تاریخ انتشار 1993